Termination Proof Script
Consider the TRS R consisting of the rewrite rule
|
| 1: |
|
f(s(x),y,y) |
→ f(y,x,s(x)) |
|
There is one dependency pair:
|
| 2: |
|
F(s(x),y,y) |
→ F(y,x,s(x)) |
|
The approximated dependency graph contains no SCCs
and hence the TRS is trivially terminating.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006